Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
نویسندگان
چکیده
Fractional minimum positive semidefinite rank is defined from r-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement. An r-fold version of the traditional definition of minimum positive semidefinite rank of a graph using Hermitian matrices that fit the graph is also presented. This paper also introduces r-fold orthogonal representations of graphs and formalizes the understanding of projective rank as fractional orthogonal rank. Connections of these concepts to quantum theory, including Tsirelson’s problem, are discussed.
منابع مشابه
Orthogonal representations, minimum rank, and graph complements
Orthogonal representations are used to show that complements of certain sparse graphs have (positive semidefinite) minimum rank at most 4. This bound applies to the complement of a 2-tree and to the complement of a unicyclic graph. Hence for such graphs, the sum of the minimum rank of the graph and the minimum rank of its complement is at most two more than the order of the graph. The minimum r...
متن کاملComputing Positive Semidefinite Minimum Rank for Small Graphs
Abstract. The positive semidefinite minimum rank of a simple graph G is defined to be the smallest possible rank over all 1 positive semidefinite real symmetric matrices whose ijth entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero 2 otherwise. The computation of this parameter directly is difficult. However, there are a number of known bounding parameters 3 and technique...
متن کاملZero forcing parameters and minimum rank problems
Abstract. The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a 1 graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by 2 G. It is shown that for a connected graph of order at least two, no vertex is in every zero forcing set. The positive 3 semidefinite zero forcing number Z+(G) is introduced, and ...
متن کاملBounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
In this paper we study bipartite quantum correlations using techniques from tracial polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a qua...
متن کاملSupport-based lower bounds for the positive semidefinite rank of a nonnegative matrix
The positive semidefinite rank of a nonnegative (m×n)-matrix S is the minimum number q such that there exist positive semidefinite (q × q)-matrices A1, . . . , Am, B1, . . . , Bn such that S(k, l) = trA∗kBl. The most important lower bound technique on nonnegative rank only uses the zero/nonzero pattern of the matrix. We characterize the power of lower bounds on positive semidefinite rank based ...
متن کامل